Symmetry-preserving matchings

نویسنده

  • Raül Vera
چکیده

In the literature, the matchings between spacetimes have been most of the times implicitly assumed to preserve some of the symmetries of the problem involved. But no definition for this kind of matching was given until recently. Loosely speaking, the matching hypersurface is restricted to be tangent to the orbits of a desired local group of symmetries admitted at both sides of the matching and thus admitted by the whole matched spacetime. This general definition is shown to lead to conditions on the properties of the preserved groups. First, the algebraic type of the preserved group must be kept at both sides of the matching hypersurface. Secondly, the orthogonal transivity of two-dimensional conformal (in particular isometry) groups is shown to be preserved (in a way made precise below) on the matching hypersurface. This result has in particular direct implications on the studies of axially symmetric isolated bodies in equilibrium in General Relativity, by making up the first condition that determines the suitability of convective interiors to be matched to vacuum exteriors. The definition and most of the results presented in this paper do not depend on the dimension of the manifolds involved nor the signature of the metric, and their applicability to other situations and other higher dimensional theories is manifest. PACS: 04.20.Cv, 04.40.Nr

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration of Perfect Matchings of Graphs with Rotational Symmetry by Pfaffians

Abstract. The enumeration of perfect matchings of graphs is equivalent to the dimer problem which has applications in statistical physics. A graph G is said to be n-rotation symmetric if the cyclic group of order n is a subgroup of the automorphism group of G. The enumeration of perfect matchings of graphs with reflective symmetry was studied extensively in the past. In this paper we consider t...

متن کامل

An Exploration of the Permanent-Determinant Method

The permanent-determinant method and its generalization, the HafnianPfaffian method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kasteleyn. We present several new techniques and arguments related to the permanent-determinant with consequences in enumerative combinatorics. Here are some of the results that follow from these techniques: 1. If a biparti...

متن کامل

The Complexity of Approximately Counting Stable Matchings

We investigate the complexity of approximately counting stable matchings in the k-attribute model, where the preference lists are determined by dot products of “preference vectors” with “attribute vectors”, or by Euclidean distances between “preference points“ and “attribute points”. Irving and Leather [16] proved that counting the number of stable matchings in the general case is #P -complete....

متن کامل

Perfect Matchings in Edge-Transitive Graphs

We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...

متن کامل

Equal percent bias reduction and variance proportionate modifying properties with mean–covariance preserving matching

Mean-preserving and covariance preservingmatchings are introduced that can be obtained with conditional, randomized matching on sub-populations of a large control group. Under moment conditions it is shown that these matchings are, respectively, equal percent bias reducing (EPBR) and variance proportionatemodifying (PM) for linear functions of the covariates and their standardizations. The resu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002